منابع مشابه
Generalized Permutation Patterns — a Short Survey
An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be required to be adjacent in the permutation. Subsets of permutations characterized by the avoidance—or the prescribed number of occurrences— of generalized patterns ...
متن کاملPermutation groups generated by short elements
This document was provoked by a question on the SEQFAN mailing list, which was passed on to me by Simone Severini. We consider the following four questions. How many subgroups of the symmetric group Sn are generated by • transpositions; • 3-cycles; • transpositions and 3-cycles, • products of pairs of transpositions? For each of the four questions there are three ways of counting the subgroups:...
متن کاملStrings of congruent primes in short intervals
Fix > 0, and let p1 = 2, p2 = 3, . . . be the sequence of all primes. We prove that if (q, a) = 1, then there are infinitely many pairs pr, pr+1 such that pr ≡ pr+1 ≡ a mod q and pr+1 − pr < log pr. The proof combines the ideas of Shiu and of Goldston–Pintz–Yıldırım.
متن کاملPattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concatenation. Such descriptions correspond to systems of recurrences or to context-free grammars generating single words. The descriptive size of a string is the length n of a straight-line program (or size of a grammar) whic...
متن کاملShort strings containing all k-element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1974
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90116-2